Not merely quiescent: telomeres in quiescent HSCs
نویسندگان
چکیده
منابع مشابه
Quiescent Reliable Communication and Quiescent Consensus in Partitionable Networks
We consider partitionable networks with process crashes and lossy links, and focus on the problems of reliable communication and consensus for such networks. For both problems we seek algorithms that are quiescent, i.e., algorithms that eventually stop sending messages. We first tackle the problem of reliable communication for partitionable networks by extending the results of [ACT97a]. In part...
متن کاملBetween Linearizability and Quiescent Consistency - Quantitative Quiescent Consistency
Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the number of contending threads. Quiescent consistency is an alternative criterion which guarantees that a concurrent data structure behaves correctly when accessed sequentially. Yet quiescent consistency says very little ab...
متن کاملPhase-Destabilization Mechanism of Polymer-Modified Bitumens in Quiescent Annealing
Bitumen as a binder in coating and insulating materials is modified with polymers to improve its performance in service conditions. Almost all polymers are incompatible with bitumen, and at high temperatures due to relatively very low viscosity of the bitumen phase, are separated from it. These lead to a considerable limitation in the use and handling of polymer-modified bitumens. An understand...
متن کاملOn Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links. We first show that it is impossible to solve this problem in asynchronous systems (with no failure detectors). We then show that, among failure detectors that output lists of suspects, the weakes...
متن کاملQuantitative Quiescent Consistency
Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the number of contending threads. Quiescent consistency is an alternative criterion which guarantees that a concurrent data structure behaves correctly when accessed sequentially. Yet quiescent consistency says very little ab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Blood
سال: 2014
ISSN: 0006-4971,1528-0020
DOI: 10.1182/blood-2014-10-603258